Quaternionic quantum walks of Szegedy type and zeta functions of graphs
نویسندگان
چکیده
We define a quaternionic extension of the Szegedy walk on a graph and study its right spectral properties. The condition for the transition matrix of the quaternionic Szegedy walk on a graph to be quaternionic unitary is given. In order to derive the spectral mapping theorem for the quaternionic Szegedy walk, we derive a quaternionic extension of the determinant expression of the second weighted zeta function of a graph. Our main results determine explicitly all the right eigenvalues of the quaternionic Szegedy walk by using complex right eigenvalues of the corresponding doubly weighted matrix. We also show the way to obtain eigenvectors corresponding to right eigenvalues derived from those of doubly weighted matrix.
منابع مشابه
Unitary equivalent classes of one-dimensional quantum walks
This study investigates unitary equivalent classes of one-dimensional quantum walks. We prove that one-dimensional quantum walks are unitary equivalent to quantum walks of Ambainis type and that translation-invariant one-dimensional quantum walks are Szegedy walks. We also present a necessary and sufficient condition for a onedimensional quantum walk to be a Szegedy walk.
متن کاملSpecial Bertrand Curves in semi-Euclidean space E4^2 and their Characterizations
In [14] Matsuda and Yorozu.explained that there is no special Bertrand curves in Eⁿ and they new kind of Bertrand curves called (1,3)-type Bertrand curves Euclidean space. In this paper , by using the similar methods given by Matsuda and Yorozu [14], we obtain that bitorsion of the quaternionic curve is not equal to zero in semi-Euclidean space E4^2. Obtain (N,B2) type quaternionic Bertrand cur...
متن کاملZeta Functions and Chaos
This paper is an expanded version of lectures given at M.S.R.I. in June of 2008. It provides an introduction to various zeta functions emphasizing zeta functions of a finite graph and connections with random matrix theory and quantum chaos. Section 2. Three Zeta Functions For the number theorist, most zeta functions are multiplicative generating functions for something like primes (or prime ide...
متن کاملAn O(n) Quantum Algorithm for the Triangle Problem
We present a new quantum algorithm that either finds a triangle (a copy of K3) in an undirected graph G on n nodes, or it outputs “reject” if G is triangle free. The algorithm uses O(n) queries, and it is based on a new design concept of Ambainis [Amb03] that incorporates the benefits of quantum walks into Grover search [Gro96]. The algorithm both improves on, and is simpler than a recent algor...
متن کاملQuantum Walks and Ground State Problems
OF THE DISSERTATION Quantum walks and ground state problems by Peter Courtland Richter Dissertation Director: Mario Szegedy Since the appearance of Shor’s factoring algorithm in 1994, the search for novel quantum computer algorithms has proved surprisingly difficult. Two design approaches that have yielded some progress are quantum walks and adiabatic computing. The former has been shown to spe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Quantum Information & Computation
دوره 17 شماره
صفحات -
تاریخ انتشار 2017